Codes detecting, locating and correcting random errors occurring in multiple sub-blocks

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal codes for correcting single errors and detecting adjacent errors

Optimal codes that correct single errors and detect double errors within nibbles of power of two length are presented. For each n, a code of length n, with the largest possible dimension which corrects single errors and detects double adjacent errors is presented. The problem of constructing optimal codes, which correct single errors and detect double adjacent errors within nibbles of length 1 ...

متن کامل

Locating and Correcting Errors in Images

Most image interpolation or extrapolation algorithms assume that the locations of the unknown pixels are known. In this paper we attempt to remove this restriction. More precisely, we propose an algorithm for locating the incorrect pixels of an image, assuming only partial knowledge of its Fourier transform. Note that this is a nonlinear problem: the unknown quantities are the positions and val...

متن کامل

Locating and Correcting Errors in ImagesPaulo

Most image interpolation or extrapolation algorithms assume that the locations of the unknown pixels are known. In this paper we attempt to remove this restriction. More precisely, we propose an algorithm for locating the incorrect pixels of an image, assuming only partial knowledge of its Fourier transform. Note that this is a nonlinear problem: the unknown quantities are the positions and val...

متن کامل

On Linear Codes Correcting Random and Low-Denslty Burst Errors

This paper presents lower and upper bounds on the number of parity-check digits required for a linear code that corrects random errors and errors which are in the form of low-density bursts.

متن کامل

Error Locating Codes by Using Blockwise-tensor Product of Blockwise Detecting/correcting Codes

In this paper, we obtain lower and upper bounds on the number of parity check digits of a linear code that corrects e or less errors within a subblock. An example of such a code is provided. We introduce blockwise-tensor product of matrices and using this, we propose classes of error locating codes (or EL-codes) that can detect e or less errors within a sub-block and locate several such corrupt...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proyecciones (Antofagasta)

سال: 2019

ISSN: 0716-0917

DOI: 10.4067/s0716-09172019000100129